from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
↳ QTRS
↳ DependencyPairsProof
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
AFTER(s(N), cons(X, XS)) → AFTER(N, XS)
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
AFTER(s(N), cons(X, XS)) → AFTER(N, XS)
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
AFTER(s(N), cons(X, XS)) → AFTER(N, XS)
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
AFTER(s(N), cons(X, XS)) → AFTER(N, XS)
The value of delta used in the strict ordering is 16.
POL(cons(x1, x2)) = 4 + (2)x_1 + (4)x_2
POL(AFTER(x1, x2)) = (4)x_2
POL(s(x1)) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, XS)